Counting Decomposable Univariate Polynomials
نویسندگان
چکیده
منابع مشابه
The Number of Decomposable Univariate Polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملThe number of decomposable univariate polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملCertified counting of roots of random univariate polynomials
A challenging problem in computational mathematics is to compute roots of a high-degree univariate random polynomial. We combine an efficient multiprecision implementation for solving high-degree random polynomials with two certification methods, namely Smale’s α-theory and one based on Gerschgorin’s theorem, for showing that a given numerical approximation is in the quadratic convergence regio...
متن کاملOn Counting Polynomials of Some Nanostructures
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
متن کاملZero sets of univariate polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2014
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548314000388